Some Properties of Codes with Infinite Deciphering Delay
نویسندگان
چکیده
In 2013, Tommi Lehtinen and Alexander Okhotin proved that if X is a code, then it has infinite deciphering delay if and only if there exist + ∈ A z y x , , with * , , , X zy yz xy x ∈ and * , X z y ∉ . In this paper, we give a sufficient and necessary condition for codes with infinite deciphering delay. Then, we construct two kinds of three-element codes with infinite deciphering delay.
منابع مشابه
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
In this paper we generalize an encoding method due to Girod (cf. [7]), based on binary prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A∗, whose length depends on the deciphering delay. We moreover define, as in [5], a d...
متن کاملExistence and uniqueness of solutions for neutral periodic integro-differential equations with infinite delay
...
متن کاملOn codes with a finite deciphering delay: constructing uncompletable words
Let X be a non-complete code with a nite deciphering delay. We prove that an uncompletable word w of length O(md) exists, where d stands for the delay and m stands for the length of the longest words in X . The proof leads to an explicit construction of w. This result partially resolves a conjecture proposed by Antonio Restivo in 1979. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملDecidability of code properties
We explore the borderline between decidability and undecidability of the following question: “Let C be a class of codes. Given a machineM of type X , is it decidable whether the language L(M) lies in C or not?” for codes in general, ω-codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down s...
متن کاملExtended and infinite ordered weighted averaging and sum operators with numerical examples
This study discusses some variants of Ordered WeightedAveraging (OWA) operators and related information aggregation methods. Indetail, we define the Extended Ordered Weighted Sum (EOWS) operator and theExtended Ordered Weighted Averaging (EOWA) operator, which are applied inscientometrics evaluation where the preference is over finitely manyrepresentative works. As...
متن کامل